Inter-application Redundancy Elimination in Sensor Networks with Compiler- Assisted Scheduling VG-CAS-11

Most current-generation Wireless Sensor Network(WSN) nodes are equipped with multiple sensors of varioustypes, and therefore support for multi-tasking and multipleconcurrent applications is becoming increasingly common. Thistrend has been fostering the design of WSNs allowing severalconcurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holisticprogramming scheme by designing a novel compilerassistedscheduling approach (called REIS) able to identify and eliminateredundancies across applications. To achieve this useful high-leveloptimization, we model each user application as a linear sequenceof executable instructions. We show how well-known string-matching algorithms such as the Longest Common Subsequence(LCS) and the Shortest Common Super-sequence (SCS) canbe used to produce an optimal merged monolithic sequenceof the deployed applications that takes into account embeddedscheduling information. We show that our approach can help inachieving about 60% average energy savings in processor usagecompared to the normal execution of concurrent applications. Inter-application Redundancy Elimination in Wireless Sensor Networks with Compiler-Assisted Scheduling Vikram Gupta†‡, Eduardo Tovar†, Karthik Lakshmanan‡, Ragunathan (Raj) Rajkumar‡ †CISTER Research Center, ISEP, Polytechnic Institute of Porto, Portugal ‡Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA [email protected], [email protected], {klakshma, raj}@ece.cmu.edu Abstract—Most current-generation Wireless Sensor Network (WSN) nodes are equipped with multiple sensors of various types, and therefore support for multi-tasking and multiple concurrent applications is becoming increasingly common. This trend has been fostering the design of WSNs allowing several concurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (called REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-level optimization, we model each user application as a linear sequence of executable instructions. We show how well-known stringmatching algorithms such as the Longest Common Subsequence (LCS) and the Shortest Common Super-sequence (SCS) can be used to produce an optimal merged monolithic sequence of the deployed applications that takes into account embedded scheduling information. We show that our approach can help in achieving about 60% average energy savings in processor usage compared to the normal execution of concurrent applications.Most current-generation Wireless Sensor Network (WSN) nodes are equipped with multiple sensors of various types, and therefore support for multi-tasking and multiple concurrent applications is becoming increasingly common. This trend has been fostering the design of WSNs allowing several concurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (called REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-level optimization, we model each user application as a linear sequence of executable instructions. We show how well-known stringmatching algorithms such as the Longest Common Subsequence (LCS) and the Shortest Common Super-sequence (SCS) can be used to produce an optimal merged monolithic sequence of the deployed applications that takes into account embedded scheduling information. We show that our approach can help in achieving about 60% average energy savings in processor usage compared to the normal execution of concurrent applications. Keywords-Wireless Sensor Networks; Energy Optimization; Scheduling;Compilers;